KOMOS – A Keyword Occurrence Method for Ordering Search Results
نویسندگان
چکیده
منابع مشابه
KOMOS – A Keyword Occurrence Method for Ordering Search Results
Information retrieval is the most common objective of internet users. For a given query, existing search engines will return a long list of search results ranked by their relevance to the given query. In most of the existing search engines, Page Rank algorithm is used to find the relevance of the documents to the given query. The problem with this method is that it considers only the incoming a...
متن کاملA Framework for Grouping and Summarizing Keyword Search Results
With the rapid growth of the Web, keyword-based searches become extremely ambiguous. To guide users to identify the results of their interest, in this paper, we consider an alternative way for presenting the results of a keyword search. In particular, we propose a framework for organizing the results into groups that contain results with similar content and refer to similar temporal characteris...
متن کاملA Novel Discriminative Score Calibration Method for Keyword Search
The performance of keyword search systems depends heavily on the quality of confidence scores. In this work, a novel discriminative score calibration method has been proposed. By training an MLP classifier employing the word posterior probability and several novel normalized scores, we can obtain a relative improvement of 4.67% for the actual term-weighted value (ATWV) metric on the OpenKWS15 d...
متن کاملA Distance-Based Spelling Suggestion Method for XML Keyword Search
Abstract. We study the spelling suggestion problem for keyword search on XML documents. To address the problems in existing work, we propose a distance-based approach to suggesting meaningful query candidates for an issued query. Our approach uses distance to measure the relationship between keyword matching nodes, and ranks a candidate higher if there are closely-related nodes in the database ...
متن کاملListBM: A Learning-to-Rank Method for XML Keyword Search
This paper describes Peking University’s approach to the Ad Hoc Track. In our first participation, results for all four tasks were submitted: the Best In Context, the Focused, the Relevance In Context and the Thorough. Based on retrieval method Okapi BM25, we implement two different ranking methods NormalBM25 and LearningBM25 according to different parameter settings. Specially, the parameters ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2010
ISSN: 0975-8887
DOI: 10.5120/683-961